On the steady-state probability of delay and large negative deviations for the GI/GI/n queue in the Halfin-Whitt regime

نویسنده

  • David A. Goldberg
چکیده

We consider the FCFS GI/GI/n queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exists ε > 0, depending on the inter-arrival and processing time distributions, such that the s.s.p.d. is bounded from above by exp ( − εB ) as the associated excess parameter B →∞; and by 1− εB as B → 0. We also prove that the tail of the steady-state number of idle servers has a Gaussian decay, and use known results to show that our bounds are tight (in an appropriate sense). Our main proof technique is the derivation of new stochastic comparison bounds for the FCFS GI/GI/n queue, which are of a structural nature, hold for all n and times t, and build on the recent work of Gamarnik and Goldberg [21].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steady-state GI/G/n queue in the Halfin–Whitt regime

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We consider the FCFS GI/GI/n queue in the so-called Halfin–Whitt heavy traffic regime. We prove that under minor te...

متن کامل

Probability STEADY - STATE GI / GI / n QUEUE IN THE HALFIN - WHITT REGIME

We consider the FCFS GI/GI/n queue in the so-called HalfinWhitt heavy traffic regime. We prove that under minor technical conditions the associated sequence of steady-state queue length distributions, normalized by n 1 2 , is tight. We derive an upper bound on the large deviation exponent of the limiting steady-state queue length matching that conjectured by Gamarnik and Momcilovic in [16]. We ...

متن کامل

A Diffusion Approximation for the G/GI/n/m Queue

We develop a diffusion approximation for the queue-length stochastic process in the G/GI/n/m queueing model (having a general arrival process, independent and identically distributed service times with a general distribution, n servers, and m extra waiting spaces). We use the steady-state distribution of that diffusion process to obtain approximations for steady-state performance measures of th...

متن کامل

Heavy-tailed queues in the Halfin-Whitt regime

We consider the FCFS GI/GI/n queue in the Halfin-Whitt heavy traffic regime, in the presence of heavy-tailed distributions (i.e. infinite variance). We prove that under minimal assumptions, i.e. only that processing times have finite 1 + moment for some > 0 and inter-arrival times have finite second moment, the sequence of stationary queue length distributions, normalized by n 1 2 , is tight in...

متن کامل

Simple and explicit bounds for multi-server queues

We consider the FCFS GI/GI/n queue, and prove the first simple and explicit bounds that scale gracefully and universally as 1 1−ρ (and better), with ρ the corresponding traffic intensity. In particular, we prove the first multi-server analogue of Kingman’s bound, which has been an open problem for over fifty years. Our main results are bounds for the tail of the steady-state queue length and th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013